The phase transition in the uniformly grown random graph has infinite order
نویسندگان
چکیده
منابع مشابه
The phase transition in the uniformly grown random graph has infinite order
The aim of this paper is to study the emergence of the giant component in the uniformly grown random graph Gn(c), 0 < c < 1, the graph on the set [n] = {1, 2, . . . , n} in which each possible edge ij is present with probability c/max{i, j}, independently of all other edges. Equivalently, we may start with the random graph Gn(1) with vertex set [n], where each vertex j is joined to each ‘earlie...
متن کاملThe Condensation Phase Transition in Random Graph Coloring
Based on a non-rigorous formalism called the “cavity method”, physicists have put forward intriguing predictions on phase transitions in discrete structures. One of the most remarkable ones is that in problems such as random k-SAT or random graph k-coloring, very shortly before the threshold for the existence of solutions there occurs another phase transition called condensation [Krzakala et al...
متن کاملHigh-order Phase Transition in Random Hypergrpahs
In this paper, we study the high-order phase transition in random r-uniform hypergraphs. For a positive integer n and a real p ∈ [0, 1], let H := H(n, p) be the random r-uniform hypergraph on the vertex set [n], where each r-set is an edge with probability p independently. For 1 ≤ s ≤ r − 1 and two s-sets S and S, we say S is connected to S if there is a sequence of alternating s-sets and edges...
متن کاملEFFECT OF THE NEXT-NEAREST NEIGHBOR INTERACTION ON THE ORDER-DISORDER PHASE TRANSITION
In this work, one and two-dimensional lattices are studied theoretically by a statistical mechanical approach. The nearest and next-nearest neighbor interactions are both taken into account, and the approximate thermodynamic properties of the lattices are calculated. The results of our calculations show that: (1) even though the next-nearest neighbor interaction may have an insignificant ef...
متن کاملON THE INFINITE ORDER MARKOV PROCESSES
The notion of infinite order Markov process is introduced and the Markov property of the flow of information is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2004
ISSN: 1042-9832
DOI: 10.1002/rsa.20041